Variations on the Tait-Kneser theorem

نویسندگان

  • Serge Tabachnikov
  • Vladlen Timorin
چکیده

At every point, a smooth plane curve can be approximated, to second order, by a circle; this circle is called osculating. One may think of the osculating circle as passing through three infinitesimally close points of the curve. A vertex of the curve is a point at which the osculating circle hyper-osculates: it approximates the curve to third order. Equivalently, a vertex is a critical point of the curvature function. Consider a (necessarily non-closed) curve, free from vertices. The classical Tait-Kneser theorem [13, 5] (see also [3, 10]), states that the osculating circles of the curve are pairwise disjoint, see Figure 1. This theorem is closely related to the four vertex theorem of S. Mukhopadhyaya [8] that a plane oval has at least 4 vertices (see again [3, 10]). Figure 1 illustrates the Tait-Kneser theorem: it shows an annulus foliated by osculating circles of a curve.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 3 Fe b 20 06 Variations on the Tait – Kneser theorem

At every point, a smooth plane curve can be approximated, to second order, by a circle; this circle is called osculating. One may think of the osculating circle as passing through three infinitesimally close points of the curve. A vertex of the curve is a point at which the osculating circle hyper-osculates: it approximates the curve to third order. Equivalently, a vertex is a critical point of...

متن کامل

Generalized Kneser Coloring Theorems with Combinatorial Proofs

The Kneser conjecture (1955) was proved by Lovász (1978) using the Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its extensions. Only in 2000, Matoušek provided the first combinatorial proof of the Kneser conjecture. Here we provide a hypergraph coloring theorem, with a combinatorial proof...

متن کامل

Symmetries of the Stable Kneser Graphs

It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...

متن کامل

m at h . D G ] 1 4 Fe b 20 06 Variations on A . Kneser ’ s theorem

At every point, a smooth plane curve can be approximated, to second order, by a circle; this circle is called osculating. One may think of the osculating circle as passing through three infinitesimally close points of the curve. A vertex of the curve is a point at which the osculating circle hyper-osculates: it approximates the curve to third order. Equivalently, a vertex is a critical point of...

متن کامل

Combinatorial Consequences of Relatives of the Lusternik-Schnirelmann-Borsuk Theorem

Call a set of 2n + k elements Kneser-colored when its n-subsets are put into classes such that disjoint n-subsets are in different classes. Kneser showed that k + 2 classes are sufficient to Kneser-color the n-subsets of a 2n + k element set. There are several proofs that this same number is necessary which rely on fixed-point theorems related to the Lusternik-SchnirelmannBorsuk (LSB) theorem. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006